Cech Type Approach to Computing Homology of Maps

نویسنده

  • Marian Mrozek
چکیده

A new approach to algorithmic computation of the homology of spaces and maps is presented. The key point of the approach is a change in the representation of sets. The proposed representation is based on a combinatorial variant of the Čech homology and the Nerve Theorem. In many situations this change of the representation of the input may help in bypassing the problems with the complexity of the standard homology algorithms by reducing the size of nedcessary input. We show that the approach is particularly advantegous in the case of homology map algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A parametrized version of the Borsuk Ulam theorem

The main result of this note is a parametrized version of the BorsukUlam theorem. Loosely speaking, it states that for a map X × S → S (with k < n), considered as a family of maps from S to S, the set of solutions to the Borsuk-Ulam problem (i.e. opposite points in S with the same value) depends continuously on X. We actually formuate this for correspondences. The “continuity” is measured by th...

متن کامل

A Furi-Pera theorem in Hausdorff topological spaces for acyclic maps

We present new Furi-Pera theorems for acyclic maps between topological spaces. 1. Introduction. In this paper, we present new Furi-Pera theorems [6, 7] for acyclic maps between Hausdorff topological spaces. The main result in our paper is based on a new Leray-Schauder alternative [1] for such maps which in turn is based on the notion of compactly null-homotopic. We first recall some results and...

متن کامل

The Coincidence Problem for Compositions of Set-valued Maps

If A is compact, then A and B have a coincidence, that is, there exists (z0, Vo) € X x Y with y0 G A(x0) D B(x0). [Recall that a nonempty compact space is acyclic if all its reduced Cech homology groups over Q vanish.] The proof of Theorem 0 relies on a Lefschetz-type fixed point theorem of Gorniewicz and Granas [14] which is itself based on sophisticated homological machinery. One of our conce...

متن کامل

Statistical Topology Using the Nonparametric Density Estimation and Bootstrap Algorithm

This paper presents approximate confidence intervals for each function of parameters in a Banach space based on a bootstrap algorithm. We apply kernel density approach to estimate the persistence landscape. In addition, we evaluate the quality distribution function estimator of random variables using integrated mean square error (IMSE). The results of simulation studies show a significant impro...

متن کامل

An Algorithmic Approach to the Construction of Homomorphisms Induced by Maps in Homology

This paper is devoted to giving the theoretical background for an algorithm for computing homomorphisms induced by maps in homology. The principal idea is to insert the graph of a given continuous map f into a graph of a multi-valued representable map F . The multi-valued representable maps have well developed continuity properties and admit a finite coding that permits treating them by combina...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2010